Wildfire Spreading Simulator Using Fast Marching Algorithm
نویسندگان
چکیده
منابع مشابه
Moving object localisation using a multi-label fast marching algorithm
In this paper, we address two problems crucial to motion analysis: the detection of moving objects and their localisation. Statistical and level set approaches are adopted in formulating these problems. For the change detection problem, the inter-frame di!erence is modelled by a mixture of two zero-mean Laplacian distributions. At "rst, statistical tests using criteria with negligible error pro...
متن کاملSegmentation Using Fast Marching Method
The paper deals with a novel segmentation technique applicable to colour video sequences. The algorithm uses Fast Marching Method for automatic extraction of semantic objects from natural colour video sequences by joint motion and colour analysis. The algorithm handles background in the same way as other objects, thus it does not need global motion compensation. The number of control parameters...
متن کاملRobot formation motion planning using Fast Marching
This paper presents the application of the Voronoi Fast Marching method to Path Planning of Mobile Formation Robots. The Voronoi Fast Marching method uses the propagation of a wave (Fast Marching) operating on the world model to determine a motion plan over a viscosity map (similar to the refraction index in optics) extracted from the updated map model. The computational efficiency of the metho...
متن کاملFractal dimensions of wildfire spreading
The time series data of 31 wildfires in 2012 in the US were analyzed. The fractal dimensions (FD) of the wildfires during spreading were studied and their geological features were identified. A growth model based on the cellular automata method is proposed here. Numerical study was performed and is shown to give good agreement with the fractal dimensions and scaling behaviors of the correspondi...
متن کاملCurve Matching Using the Fast Marching Method
Common techniques for curve alignment find a solution in the form of a shortest network path by means of dynamic programming. In this paper we present an approach that employs Sethian’s Fast Marching Method to find the solution with sub-resolution accuracy and in consistence with the underlying continuous problem. We demonstrate how the method may be applied to compare closed curves, morph one ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Simulation notes Europe
سال: 2021
ISSN: ['2305-9974', '2306-0271']
DOI: https://doi.org/10.11128/sne.31.tn.10577